On ‘stop=repeat' servicing for non-exponential queueing networks with blocking
نویسندگان
چکیده
منابع مشابه
SERIE RESEARCH mEIHORnnDH ON "STOP = REPEAT" SERVICING FOR NON-EXPONENTIAL QUEUEING NETWORKS WITH BLOCKING
The communication blocking protocols of stopping or repeating a service in non-exponential queueing networks with blocking are shown to be equivalent under a partial balance condition. Examples both with a reversible and nonreversible routing are given.
متن کاملA Non-exponential Queueing System with Batch Servicing
A finite source queueing system is studied in which jobs generated by a source arrive independently but are served in a batch manner. The servicing includes source interdependencies. The input and service distributions are allowed to be generally distributed. A nonstandard product form expression is obtained for the steady state joint queue length distribution and shown to be insensitive (i.e. ...
متن کاملSERIE RESEARCH mEITlORBnun "STOP = RECIRCULATE" FOR EXPONENTIAL PRODUCT FORM QUEUEING NETWORKS WITH DEPARTURE BLOCKING
The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.
متن کاملPerformance Analysis of Queueing Networks with Blocking
Queueing network models have been widely applied for performance modeling and analysis of computer networks. Queueing network models with finite capacity queues and blocking (QNB) allow representing and analyzing systems with finite resources and population constraints. Different protocols can be defined to deal with finite capacity resources and they can be modeled in queueing networks with bl...
متن کاملOn exponential ergodicity of multiclass queueing networks
One of the key performance measures in queueing systems is the exponential decay rate of the steady-state tail probabilities of the queue lengths. It is known that if a corresponding fluid model is stable and the stochastic primitives have finite moments, then the queue lengths also have finite moments, so that the tail probability P(· > s) decays faster than s−n for any n. It is natural to con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 1991
ISSN: 0021-9002,1475-6072
DOI: 10.1017/s0021900200039504